منابع مشابه
Optimal Bidding in Sequential Auctions
A bidder's strategy in one auction may affect his competitors' behavior in subsequent auctions. When this occurs, bidding in a sequence of auctions can be modeled fruitfully as a multistage control process. This paper presents such a model. In it the control is the bidder's strategy, the state characterizes the competitors' behavior and the state transition represents the competitors' reaction ...
متن کاملOptimal Bidding in Sequential Online Auctions
Auctions are widely used online to conduct commercial transactions. An important feature of online auctions is that even bidders who intend to buy a single object frequently have the opportunity to bid in sequential auctions selling identical objects. This paper studies key features of the optimal bidding strategy, assuming rational, risk-neutral agents with independent private valuations and s...
متن کاملOn optimal bidding in sequential procurement auctions
We investigate the problem of optimal bidding for a firm that in each period procures items to meet a random demand by participating in a finite sequence of auctions. We develop a new model for a firm where its item valuation derives from the sale of the acquired items via their demand distribution, sale price, acquisition cost, salvage value and lost sales. We establish monotonicity properties...
متن کاملOptimal Bidding in Sequential Procurement Auctions
We consider the problem of a firm that in each period procures items by participating in auctions and then it sells the acquired items by the end of the period, where any unsold items are salvaged. The objective of the firm is to have a bidding policy that maximizes the expected value of its profit over N auctions. In this model the firm’s valuations derive from the resale of acquired items via...
متن کاملOptimal Bidding in Online Auctions
Online auctions are arguably one of the most important and distinctly new applications of the Internet. The predominant player in online auctions, eBay, has over 42 million users, and it was the host of over $9.3 billion worth of goods sold just in the year 2001. Using methods from approximate dynamic programming and integer programming, we design algorithms for optimally bidding for a single i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1975
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.23.6.1080